JPEX: A Psychologically Plausible Joint Probability EXtractor

نویسنده

  • Sébastien Hélie
چکیده

Extracting redundancies in the data is the main purpose of unsupervised learning and estimating the covariance using Hebbian learning is a widespread way to achieve this. However, Hebbian learning only leads to the extraction of between-unit covariance. Because most associative memories use distributed representations, it would be more useful to extract the covariance of states. Yet, this operation would still be insufficient to fully model more complex environments, which include higher-order relations. In the present paper, we propose a new architecture, JPEX, which extracts higherorder joint probabilities at the state level using the tensor product as a learning rule. This new learning rule is compared with simple Hebbian learning in an environment which includes second-order relations. Also, JPEX’s ability to learn non-linear relationships is illustrated by training the model on the XOR categorization problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bottom-up learning of explicit knowledge using a Bayesian algorithm and a new Hebbian learning rule

The goal of this article is to propose a new cognitive model that focuses on bottom-up learning of explicit knowledge (i.e., the transformation of implicit knowledge into explicit knowledge). This phenomenon has recently received much attention in empirical research that was not accompanied by a corresponding work effort in cognitive modeling. The new model is called TEnsor LEarning of CAusal S...

متن کامل

A psychologically plausible and computationally effective approach to learning syntax

Computational learning of natural language is often attempted without using the knowledge available from other research areas such as psychology and linguistics. This can lead to systems that solve problems that are neither theoretically or practically useful. In this paper we present a system CLL which aims to learn natural language syntax in a way that is both computationally effective and ps...

متن کامل

Probability Matching via Deterministic Neural Networks

We propose a constructive neural-network model comprised of deterministic units which estimates and represents probability distributions from observable events — a phenomenon related to the concept of probability matching. We use a form of operant learning, where the underlying probabilities are learned from positive and negative reinforcements of the inputs. Our model is psychologically plausi...

متن کامل

Multi-view (Joint) Probability Linear Discrimination Analysis for Multi-view Feature Verification

Multi-view feature has been proved to be very effective in many multimedia applications. However, the current back-end classifiers cannot make full use of such features. In this paper, we propose a method to model the multi-faceted information in the multi-view features explicitly and jointly. In our approach, the feature was modeled as a result derived by a generative multi-view (joint) Probab...

متن کامل

A Psychologically Plausible Algorithm for Binocular Shape Reconstruction

: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : xiii

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006